A Rank Based Replacement Policy for Multimedia Server Cache Using Zipf-Like Law

نویسندگان

  • T. R. Gopalakrishnan Nair
  • P. Jayarekha
چکیده

The cache replacement algorithm plays an important role in the overall performance of Proxy-Server system. In this paper we have proposed VoD cache memory replacement algorithm for a multimedia server system. We propose a Rank based cache replacement policy to manage the cache space in individual proxy server cache. Proposed replacement strategy incorporates in a simple way the most important characteristics of the video and its accesses such as its size, access frequency, recentness of the last access and the cost incurred while transferring the requested video from the server to the proxy. We compare our algorithm with some popular cache replacement algorithm using simulation. The video objects are ranked based on the access trend by considering the factors such as size, frequency and cost. Many studies have demonstrated that Zipf’s-like law can govern many features of the VoD and is used to describe the popularity of the video. In this paper, we have designed a model, which ranks the video on the basis of its popularity using the Zipf-like law. The video with higher ranking is named “hot”, while the video with lower ranking is named “cold”. The result show that the proposed rank based algorithm improves cache hit ratio, cache byte ratio and average request latencies compared to other algorithms. Our experimental results indicate that Rank based cache replacement algorithm outperforms LRU, LFU and Greedy Dual.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Cache Replacement Policy and Its Simulation Results

To optimize the multimedia proxy server effectively, this paper proposes a gain-based cache replacement policy by using the multimedia proxy server gain model. The performance of the proposed gain-based policy is evaluated by simulation experiments.

متن کامل

ProWGen: a synthetic workload generation tool for simulation evaluation of web proxy caches

This paper describes the design and use of a synthetic Web proxy workload generator called ProWGen to investigate the sensitivity of Web proxy cache replacement policies to five selected Web workload characteristics. Three representative cache replacement policies are considered in the simulation study: a recency-based policy called Least-Recently-Used (LRU), a frequency-based policy called Lea...

متن کامل

On the universality of rank distributions of website popularity

We present an extensive analysis of long-term statistics of the queries to websites using logs collected on several web caches in Russian academic networks and on US IRCache caches. We check the sensitivity of the statistics to several parameters: (1) duration of data collection, (2) geographical location of the cache server collecting data, and (3) the year of data collection. We propose a two...

متن کامل

New principles of Web cache construction

An internet traffic caching system based on a Zipf-like distribution (ZBS) is invented. New system construction consists of three parts: a kernel for storing popular documents, an accessory part for unpopular documents and a management part for keeping requests’ statistic. A documents replacement algorithm based on a metric function that uses Zipf-like distribution is a part of the new ZBS system.

متن کامل

The output of a cache under the independent reference model - Where did

We consider a cache operating under a demand-driven replacement policy when document requests are modeled according to the Independent Reference Model (IRM). We characterize the popularity pmf of the stream of misses from the cache, the so-called output of the cache, for a large class of cache replacement policies, including standard on-demand replacement algorithms such as the policy A0 and th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1003.4062  شماره 

صفحات  -

تاریخ انتشار 2010